Deducibility and Exactness
نویسنده
چکیده
What I intend to show in this short paper is how one can translate in relational terms the concepts of deducibility and exactness which are the result of a sequence of works on homology theory and algebraic topology. As we shall see, we shall obtain as a final product the possibility to associate to an arbitrary binary relation R a difunctional relation R contained in R, in contrast with the difunctional closure of R which is larger that R. In [8] we have built from a given Ferrers relation R the relation1 R ⊙ R ( R−1 † R and proved its difunctionality, but in fact, as already noticed by Schmidt and Ströhlein ([10] p. 78 Prop. 4.4.14) R ⊙ R ( R−1 † R is difunctional even when R is arbitrary. I shall show that, in fact, R ⊙ R ( R−1 † R and Re are identical. It is important to notice that the construction used here for the definition of R is made without using the Boolean difference operation.
منابع مشابه
Deducibility constraints and blind signatures
Deducibility constraints represent in a symbolic way the infinite set of possible executions of a finite protocol. Solving a deducibility constraint amounts to finding all possible ways of filling the gaps in a proof. For finite local inference systems, there is an algorithm that reduces any deducibility constraint to a finite set of solved forms. This allows one to decide any trace security pr...
متن کاملOn Retaining Classical Truths and Classical Deducibility in Many-Valued and Fuzzy Logics
DeWitt, Richard. 2005. On retaining classical truths and classical deducibility in many-valued and fuzzy logics. DeWitt, Richard, "On retaining classical truths and classical deducibility in many-valued and fuzzy logics" (2005). Philosophy Faculty Publications. Paper 3.
متن کاملReachability as deducibility, finite countermodels and verification
We propose a simple but powerful approach to the verification of parameterised systems. The approach is based on modelling the reachability between parameterized states as deducibility between suitable encodings of states by formulae of first-order predicate logic. To establish a safety property, that is non-reachability of unsafe states, the finite model finder is used to find a finite counter...
متن کاملIntruder deducibility constraints with negation. Decidability and application to secured service compositions
The problem of finding a mediator to compose secured services has been reduced in our former work to the problem of solving deducibility constraints similar to those employed for cryptographic protocol analysis. We extend in this paper the mediator synthesis procedure by a construction for expressing that some data is not accessible to the mediator. Then we give a decision procedure for verifyi...
متن کاملSergiu Bursuc , Hubert Comon - Lundh and Stéphanie Delaune Deducibility constraints Research Report LSV - 09 - 17 July 2009
In their work on tractable deduction systems, D. McAllester and later D. Basin and H. Ganzinger have identified a property of inference systems (the locality property) that ensures the tractability of the Entscheidungsproblem. On the other hand, deducibility constraints are sequences of deduction problems in which some parts (formulas) are unknown. The problem is to decide their satisfiability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logic Journal of the IGPL
دوره 6 شماره
صفحات -
تاریخ انتشار 1998